signalizer functor造句
例句與造句
- This is used in both the proof and applications of the Solvable Signalizer Functor Theorem.
- If the subgroups \ theta ( a ) are all solvable, then the signalizer functor \ theta itself is said to be solvable.
- Thus, the Solvable Signalizer Functor Theorem can be rephrased by saying that if A has at least three generators, then every solvable A-signalizer functor on G is solvably complete.
- Thus, the Solvable Signalizer Functor Theorem can be rephrased by saying that if A has at least three generators, then every solvable A-signalizer functor on G is solvably complete.
- Verifying the balance condition for this \ theta under this assumption requires a famous lemma, known as Thompson's P \ times Q-lemma . ( Note, this lemma is also called Thompson's A \ times B-lemma, but the A in this use must not be confused with the A appearing in the definition of a signalizer functor !)
- It's difficult to find signalizer functor in a sentence. 用signalizer functor造句挺難的
- This is because if a group has sectional 2-rank at least 5 then MacWilliams showed that its Sylow 2-subgroups are connected, and the balance theorem implies that any simple group with connected Sylow 2-subgroups is either of component type or characteristic 2 type . ( For groups of low 2-rank the proof of this breaks down, because theorems such as the signalizer functor theorem only work for groups with elementary abelian subgroups of rank at least 3 .)